Minimal Sparse Sampling for Fourier-polynomial Chaos in Acoustic Scattering

نویسنده

  • Roger M. Oba
چکیده

Single frequency acoustic scattering from an uncertain surface (with sinusoidal components) admits an efficient Fourier-polynomial chaos (FPC) expansion of the acoustic field. The expansion coefficients are computed nonintrusively, i.e., by functional sampling from existing acoustic models. The structure of the acoustic decomposition permits sparse selection of FPC orders within the framework of the Smolyak construction. The main result shows a minimal, sparse sampling required to exactly reconstruct FPC expansions of Smolyak form. To this end, this paper defines two concepts: exactly discretizable orthonormal, function systems (EDO); and nested systems created by decimation or “fledging.” An EDO generalizes the Nyquist-Shannon sampling conditions (exact recovery of “bandlimited” functions given sufficient sampling) to multidimensional FPC expansions. EDO criteria replace the concept of polynomially exact quadrature. Fledging parallels the idea of sub-sampling for sub-bands, from higher to lower level. The FPC Smolyak construction is an EDO fledged from a full grid EDO. An EDO results exactly when the sampled FPC expansion can be inverted to find its coefficients. EDO fledging requires that the lower level (1) has grid points and expansion orders nested in the higher level, and (2) derives its map from the samples to the coefficients from the higher level map. The theory begins with a single dimension fledged EDO, since a tensor product of fledged EDOs yields a fledged tensor EDO. A sequence of nested EDO levels fledge recursively from the largest EDO. The Smolyak construction uses telescoping sums of tensor products up to a maximum level to develop nested EDO systems for sparse grids and orders. The Smolyak construction transform gives exactly the inverse of the weighted evaluation map, and that inverse has a condition number that expresses the numerical limitations of the Smolyak construction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Spectral Method for Acoustic Scattering from Rough Surfaces

An efficient and accurate spectral method is presented for scattering problems with rough surfaces. A probabilistic framework is adopted by modeling the surface roughness as random process. An improved boundary perturbation technique is employed to transform the original Helmholtz equation in a random domain into a stochastic Helmholtz equation in a fixed domain. The generalized polynomial chao...

متن کامل

Post-Maneuver Collision Probability Estimation Using Sparse Polynomial Chaos Expansions

This paper describes the use of polynomial chaos expansions to approximate the probability of a collision between two satellites after at least one performs a translation maneuver. Polynomial chaos provides a computationally efficient means to generate an approximate solution to a stochastic differential equation without introducing any assumptions on the a posteriori distribution. The stochast...

متن کامل

Adaptive Polynomial Chaos Techniques for Uncertainty Quantification of a Gas Cooled Fast Reactor Transient

Uncertainty quantification plays an increasingly important role in the nuclear community, especially with the rise of Best Estimate Plus Uncertainty methodologies. Sensitivity analysis, surrogate models, Monte Carlo sampling and several other techniques can be used to propagate input uncertainties. In recent years however polynomial chaos expansion has become a popular alternative providing hig...

متن کامل

Reconstructing Multivariate Trigonometric Polynomials by Sampling along Generated Sets

The approximation of problems in d spatial dimensions by sparse trigonometric polynomials supported on known or unknown frequency index sets I ⊂ Zd is an important task with a variety of applications. The use of a generalization of rank1 lattices as spatial discretizations offers a suitable possibility for sampling such sparse trigonometric polynomials. Given an index set of frequencies, we con...

متن کامل

A priori testing of sparse adaptive polynomial chaos expansions using an ocean general circulation model database

This work explores the implementation of an adaptive strategy to design sparse ensembles of oceanic simulations suitable for constructing polynomial chaos surrogates. We use a recently developed pseudo-spectral algorithm that is based on a direct application of the Smolyak sparse grid formula and that allows the use of arbitrary admissible sparse grids. The adaptive algorithm is tested using an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015